Wavelet thresholding estimator on B s p , q ( R n )

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On pointwise multipliers for F sp , q ( R n ) in case σ p , q < s < n / p

We give a new description of the set M(F s p,q ) of all pointwise multipliers of the TriebelLizorkin spaces F s p,q in those cases, where they consist of, possibly unbounded, functions. 1991 Mathematics Subject Classification: 46E35.

متن کامل

New Attacks on RSA with Moduli N = p r q

We present three attacks on the Prime Power RSA with modulus N = pq. In the first attack, we consider a public exponent e satisfying an equation ex − φ(N)y = z where φ(N) = pr−1(p − 1)(q − 1). We show that one can factor N if the parameters |x| and |z| satisfy |xz| < N r(r−1) (r+1)2 thereby extending the recent results of Sakar [16]. In the second attack, we consider two public exponents e1 and...

متن کامل

S P R  T C B G

This paper analyzes a certain class of combinatorial board games that includes Ayo, Tchoukaillon and Modular N–queen. We refine the existing results by providing simple and intuitive proofs using abstract combinatorics, and also reveal some interesting game positions.

متن کامل

Enumerating solutions to p(a) + q(b) = r(c) + s(d)

Let p, q, r, s be polynomials with integer coefficients. This paper presents a fast method, using very little temporary storage, to find all small integers (a, b, c, d) satisfying p(a)+q(b) = r(c)+s(d). Numerical results include all small solutions to a4 + b4 +c4 = d4; all small solutions to a4 + b4 = c4 +d4; and the smallest positive integer that can be written in 5 ways as a sum of two coprim...

متن کامل

Factoring N=p^rq^s for Large r and s

Boneh et al. showed at Crypto 99 that moduli of the form N = pq can be factored in polynomial time when r ' log p. Their algorithm is based on Coppersmith’s technique for finding small roots of polynomial equations. In this paper we show that N = pq can also be factored in polynomial time when r or s is at least (log p); therefore we identify a new class of integers that can be efficiently fact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Nonlinear Sciences and Applications

سال: 2017

ISSN: 2008-1898,2008-1901

DOI: 10.22436/jnsa.010.12.02